Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians
نویسندگان
چکیده
منابع مشابه
A measurement driven analog of adiabatic quantum computation for frustration-free Hamiltonians
Liming Zhao, 2 Carlos A. Pérez-Delgado, Simon C. Benjamin, and Joseph F. Fitzsimons 2, ∗ Singapore University of Technology and Design, 8 Somapah Road, Singapore 487372 Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 School of Computing, University of Kent, Canterbury CT2 7NF, United Kingdom Department of Materials, University of Oxford, Pa...
متن کاملRealizable Hamiltonians for Universal Adiabatic Quantum Computers
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists ...
متن کاملNeuromorphic Adiabatic Quantum Computation
Real parallel computing is possible with a quantum computer which makes use of quantum states (Nielsen & Chuang, 2000). It is well known that a quantum computation algorithm for factorization discovered by Shor (1994) is faster than any classical algorithm. Also a quantum algorithm for database search in ( ) O N quantum computation steps instead of O(N) classical steps has been proposed by Grov...
متن کاملLocal Hamiltonians in Quantum Computation
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a timedependent Hamiltonian. I show that to succeed using AQC, the Hamiltonian involved must have local structure, which leads to a result about eigenvalue gaps from information theory. I also improve results about simulating quantum ...
متن کاملRobustness of adiabatic quantum computation
The method of quantum computation by adiabatic evolution has been proposed as a general way of solving combinatorial search problems on a quantum computer [1]. Whereas a conventional quantum algorithm is implemented as a sequence of discrete unitary transformations that form a quantum circuit involving many energy levels of the computer, the adiabatic algorithm works by keeping the state of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2019
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.100.032331